A Fast, Smart Packet Classification Algorithm Based on Decomposition
نویسندگان
چکیده
منابع مشابه
A fast IPv6 packet classification algorithm based on efficient multi-bit selection
Decision tree based schemes are widely used in designing high-speed packet classification algorithms. The primary objective is to construct a decision tree with minimal storage and searching time complexity. In this paper, we proposed a novel decision tree packet classification algorithm based on Efficient Multiple Bit Selection (EMBS). In the proposed algorithm, prefix fields are transformed t...
متن کاملBitCuts: A fast packet classification algorithm using bit-level cutting
Packet classification is one of the fundamental techniques required by various network management functionalities. As the state-of-the-art of software packet classification, decision-tree algorithms employ various geometrical cutting schemes to build optimized decision trees. However, existing cutting schemes cannot meet the desired performance on large rulesets because they sacrifice either cl...
متن کاملA Packet Classification Algorithm based on Improved Decision Tree
Since the packet classification algorithm has its great importance and extensive applications, lots of scholars have done tons of researches on the algorithm. This paper presents a new method of a packet classification algorithm based on improved decision tree. In the proposed algorithm, multi-point segmentation and redundancy deletion are adopted to compress the depth of decision tree. A new d...
متن کاملHierarchical trie packet classification algorithm based on expectation-maximization clustering
With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is benef...
متن کاملA Fast T-decomposition Algorithm
T-decomposition was first proposed and implemented as an algorithm by Mark Titchener. It has applications in communication of code sets and in the fields of entropy and similarity measurement. The first implementation of a T-decomposition algorithm by Titchener was subsequently followed by a faster version named tcalc, developed in conjunction with Scott Wackrow. An improved T-decomposition alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Control Science and Engineering
سال: 2020
ISSN: 1687-5257,1687-5249
DOI: 10.1155/2020/8843471